MSCG: Robust Core-Guided MaxSAT Solving
نویسندگان
چکیده
Maximum Satisfiability (MaxSAT) is a well-known optimization version of Propositional Satisfiability (SAT) that finds a wide range of practical applications. This work describes and evaluates the Maximum Satisfiability using the Core-Guided approach solver (MSCG), which is a robust MaxSAT solver that participated in the MaxSAT Evaluation 2014.
منابع مشابه
Core-Guided Binary Search Algorithms for Maximum Satisfiability
Several MaxSAT algorithms based on iterative SAT solving have been proposed in recent years. These algorithms are in general the most efficient for real-world applications. Existing data indicates that, among MaxSAT algorithms based on iterative SAT solving, the most efficient ones are core-guided, i.e. algorithms which guide the search by iteratively computing unsatisfiable subformulas (or cor...
متن کاملImprovements to Core-Guided Binary Search for MaxSAT
Maximum Satisfiability (MaxSAT) and its weighted variants are wellknown optimization formulations of Boolean Satisfiability (SAT). Motivated by practical applications, recent years have seen the development of core-guided algorithms for MaxSAT. Among these, core-guided binary search with disjoint cores (BCD) represents a recent robust solution. This paper identifies a number of inefficiencies i...
متن کاملMaximum Satisfiability Using Core-Guided MaxSAT Resolution
Core-guided approaches to solving MAXSAT have proved to be effective on industrial problems. These approaches solve a MAXSAT formula by building a sequence of SAT formulas, where in each formula a greater weight of soft clauses can be relaxed. The soft clauses are relaxed via the addition of blocking variables, and the total weight of soft clauses that can be relaxed is limited by placing const...
متن کاملImpact of SAT-Based Preprocessing on Core-Guided MaxSAT Solving
We present a formal analysis of the impact of Boolean satisfiability (SAT) based preprocessing techniques on core-guided solvers for the constraint optimization paradigm of maximum satisfiability (MaxSAT). We analyze the behavior of two solver abstractions of the core-guided approaches. We show that SAT-based preprocessing has no effect on the best-case number of iterations required by the solv...
متن کاملWeight-Aware Core Extraction in SAT-Based MaxSAT Solving
Maximum satisfiability (MaxSAT) is today a competitive approach to tackling NP-hard optimization problems in a variety of AI and industrial domains. A great majority of the modern state-of-the-art MaxSAT solvers are core-guided, relying on a SAT solver to iteratively extract unsatisfiable cores of the soft clauses in the working formula and ruling out the found cores via adding cardinality cons...
متن کامل